Types in functional languages Dependent types and the Propositions-as-Types Isomorphism The Coq system and inductive types Rich types for programming and proving Radboud University Nijmegen

Source URL: www.cs.ru.nl

• Type theory
• Functional languages
• Proof assistants
• Dependently typed programming
• Logic in computer science
• Coq
• Dependent type
• Functional programming
• Haskell
• Inductive type
• Quicksort
• CurryHoward correspondence

Homotopy Type Theory Univalent Foundations of Mathematics T HE U NIVALENT F OUNDATIONS P ROGRAM I NSTITUTE FOR A DVANCED S TUDY

Source URL: www.heidelberg-laureate-forum.org

Automated reasoning under the theory H∗ (thesis abstract) Fritz Obermeyer February 23, 2009 In this thesis I study four extensions of untyped λ-calculi all under the maximally coarse semantics of

Source URL: fritzo.org

• Logic
• Mathematical logic
• Mathematics
• Model theory
• Logic in computer science
• Lambda calculus
• Models of computation
• Type theory
• Combinatory logic
• Theorem
• Structure
• Interpretation

DSL PLATFORMS DSL SUMMER SCHOOL 2015 TIARK ROMPF, PURDUE UNIVERSITY DSL

Source URL: vjovanov.github.io

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Data types
• Type theory
• Functional languages
• Programming language implementation
• Generalized algebraic data type
• Syntax
• Domain-specific language
• Haskell

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se

De Bruijn’s ideas on the Formalization of Mathematics Herman Geuvers Radboud Universiteit Nijmegen & Technische Universiteit Eindhoven Foundation of Mathematics for Computer-Aided Formalization Padova, 9-11 January 201

Source URL: www.cs.ru.nl

• Type theory
• Philosophy of mathematics
• Proof assistants
• Automath
• Automated theorem proving
• Proof theory
• Nicolaas Govert de Bruijn
• Mathematical proof
• Foundations of mathematics
• Mathematical logic
• Theorem
• Mathematics

This is the author’s version of the paper. The final publication has appeared in J. Number Theory), 2214–2225. A Bombieri-Vinogradov type exponential sum result with applications Kaisa Matom¨aki

Source URL: users.utu.fi

Models of type theory in univalent mathematics B. Ahrens, about jww P. LeF. Lumsdaine, V. Voevodsky Institut de Recherche en Informatique de Toulouse Université Paul Sabatier 2015–06–30

Source URL: hott-uf.gforge.inria.fr

An Algebra for Semantic Construction in Constraint-based Grammars Ann Copestake Computer Laboratory University of Cambridge New Museums Site Pembroke St, Cambridge, UK

Source URL: www.cl.cam.ac.uk

• Semantics
• Computational linguistics
• Generative linguistics
• Type theory
• Logic in computer science
• Head-driven phrase structure grammar
• Minimal recursion semantics
• Valency
• Dependency grammar
• Categorial grammar
• Structure
• Syntax

. . Π-Ware: Hardware Description with Dependent Types

Source URL: wwwhome.cs.utwente.nl

• Hardware description languages
• Functional languages
• Agda
• Chalmers University of Technology
• SystemC
• Verilog
• VHDL
• Type theory
• Haskell